List of Articles Cost

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Present an Initial Estimation Method for Logical Transaction-based Software Projects
  mehrdad shahsavari
  The first and most basic requirement for successful entry of a project, is have a realistic and reasonable estimation. In this paper, in order to increase accuracy of software projects estimation and reduce complexity of estimation process, we introduce a method called More

  The first and most basic requirement for successful entry of a project, is have a realistic and reasonable estimation. In this paper, in order to increase accuracy of software projects estimation and reduce complexity of estimation process, we introduce a method called the "Logical Transaction Point (LTP)". Our method is most appropriate for transactional software. By use of this method can estimate the total size of use-case's and size of the whole software. In this paper we will prove the more accurate the same technique as UCP method and Due to more transparency and simplicity, its deployment is easier. We provide the main basis for this method, the degree of functional point analysis (FPA) and estimation the degree of use case point (UCP). Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - A Novel Method based on the Cocomo model to increase the accuracy of software projects effort estimates
  mahdieh salari vahid khatibi amid khatibi
  20.1001.1.27170411.1399.12.45.3.3
  It is regarded as a crucial task in a software project to estimate the criteria, and effort estimation in the primary stages of software development is thus one of the most important challenges involved in management of software projects. Incorrect estimation can lead t More

  It is regarded as a crucial task in a software project to estimate the criteria, and effort estimation in the primary stages of software development is thus one of the most important challenges involved in management of software projects. Incorrect estimation can lead the project to failure. It is therefore a major task in efficient development of software projects to estimate software costs accurately. Therefore, two methods were presented in this research for effort estimation in software projects, where attempts were made to provide a way to increase accuracy through analysis of stimuli and application of metaheuristic algorithms in combination with neural networks. The first method examined the effect of the cuckoo search algorithm in optimization of the estimation coefficients in the COCOMO model, and the second method was presented as a combination of neural networks and the cuckoo search optimization algorithm to increase the accuracy of effort estimation in software development. The results obtained on two real-world datasets demonstrated the proper efficiency of the proposed methods as compared to that of similar methods. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - An Individual-Oriented Shuffled Frog Leaping Algorithm for Solving Vehicle Routing Problem
  Soheila Shafiezadeh Zahra Beheshti
  20.1001.1.27170411.1401.14.51.6.2
  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best so More

  The Vehicle Routing Problem (VRP) is one of the most important problems in supply chain management because the optimal allocation of vehicles has a significant impact on reducing costs. VRP is in the class of NP-hard problems and exact algorithms cannot find the best solution in an acceptable time. Hence, meta-heuristic algorithms can be employed to solve it. Shuffled Frog Leaping Algorithm (SFLA) is one of the meta-heuristic algorithms, which is efficient, but in some cases, its population diversity rapidly reduces, and the algorithm falls in local optima. In this study, an Individual-Oriented Shuffled Frog Leaping Algorithm (IO-SFLA) is proposed to enhance the exploration and exploitation of SFLA by exchanging the global and local information. Several VRPs in different dimensions are applied to evaluate the performance of IO-SFLA. The efficiency of IO-SFLA is compared with several improved shuffled frog leaping algorithms, Simulated Annealing (SA) and Genetic Algorithm (GA). The results show that IO-SFLA provides significant results compared with the other competitor algorithms. IO-SFLA achieves an average of 1130.442 for the best path cost. The next rank belongs to SA with an average of 1228.725. Other compared algorithms are in the lower ranks with high differences in results. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - WSTMOS: A Method For Optimizing Throughput, Energy, And Latency In Cloud Workflow Scheduling
  Arash Ghorbannia Delavar Reza Akraminejad sahar mozafari
  20.1001.1.27170411.1402.15.57.5.0
  Application of cloud computing in different datacenters around the world has led to generation of more co2 gas. In addition, energy and throughput are the two most important issues in this field. This paper has presented an energy and throughput-aware algorithm for sche More

  Application of cloud computing in different datacenters around the world has led to generation of more co2 gas. In addition, energy and throughput are the two most important issues in this field. This paper has presented an energy and throughput-aware algorithm for scheduling of compressed-instance workflows in things-internet by cluster processing in cloud. A method is presented for scheduling cloud workflows with aim of optimizing energy, throughput, and latency. In the proposed method, time and energy consumption has been improved in comparison to previous methods by creating distance parameters, clustering inputs, and considering real execution time. In WSTMOS method by considering special parameters and real execution time, we managed to reach the optimized objective function. Moreover, in the proposed method parameter of time distance of tasks to virtual machines for reduction of number of migration in virtual machines was applied. In WSTMOS method by organizing the workflow inputs to low, medium and heavy groups and also by distributing appropriate load on more suitable servers for processors threshold, we accomplished to optimize energy and cost. Energy consumption was reduced by 4.8 percent while the cost was cut down by 4.4 percent using this method in comparison to studied method. Finally, average delay time, power and workload are optimized in comparison to previous methods. Manuscript profile